Distributed NSGA-II for seismic retrofitting optimization with multi-core PC cluster
نویسندگان
چکیده
1. Abstract The distributed Genetic Algorithm (GA) for PC cluster with multi-core-CPUs is proposed as a time reducing method for determining the schemes of retrofitting existing buildings with Buckling restrained Brace (BRB). Nondominated Sorting Genetic Algorithm-II (NSGA-II), one of the derivative evolutionary algorithm in heuristic method, was applied since the optimization problem have a multi-objective function. Two problem case was selected for validating performance of the distributed GA. The first case is seismic retrofitting of a two-dimensional steel frame structure with nonlinear static analysis, and the other one is seismic retrofitting of a three-dimensional reinforced concrete frame structure with nonlinear dynamic analysis. The objectives in both problems are minimization of cost for retrofitting and damage of retrofitted frame structure. To reduce the time for searching optimal solutions, the cluster computer consists of off-the-shelf Personal Computer (PC) with central processing unit (CPU) of quad-core processor was used. The PCs of the cluster were connected to local area network (LAN) through network switch have gigabits bandwidth. As a result, this study confirmed the possibility of using the cluster computer composed with multi-core-CPUs as High Performance Computing (HPC) for seismic retrofitting optimization.
منابع مشابه
GA-Based Multi-Objective Optimization for Retrofit Design on a Multi-Core PC Cluster
This article presents a distributed nondominated sorting genetic algorithm II (NSGA-II) for optimal seismic retrofit design using buckling restrained braces (BRBs) on a cluster of multi-core PCs. In the formulation, two conflicting objective functions of the initial BRB installation cost required for seismic retrofitting and damage cost that can be incurred by earthquakes expected during the li...
متن کاملUrban Land-Use Allocation By A Cell-based Multi-Objective Optimization Algorithm
Allocating urban land-uses to land-units with regard to different criteria and constraints is considered as a spatial multi-objective problem. Generating various urban land-use layouts with respect to defined objectives for urban land-use allocation can support urban planners in confirming appropriate layouts. Hence, in this research, a multi-objective optimization algorithm based on grid is pr...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملMinimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...
متن کامل